package test;

import java.util.Arrays;
import java.util.Scanner;

/**
 * @author 郝文雪
 * @date 2022/9/9 16:13
 * @Description Test
 */
public class f360 {
    public static void main(String[] args){
        Scanner sc=new Scanner(System.in);
        int n=sc.nextInt();
        int[] arr=new int[n];
        for (int i = 0; i < n; i++) {
            arr[i]=sc.nextInt();
        }
        int[] left=new int[n];
        //从左向右的连续递增
        left[0]=1;
        for(int i=1;i<n;i++){
            if(arr[i]>arr[i-1]){
                left[i]=left[i-1]+1;
            }else{
                left[i]=1;
            }
        }
        int[] right=new int[n];
        right[n-1]=1;
        for(int i=n-2;i>=0;i--){
            if(arr[i+1]<arr[i]){
                right[i]=right[i+1]+1;
            }else{
                right[i]=1;
            }
        }
        int max=1;
        for (int i = 0; i < n; i++) {
            max=Math.max(max,left[i]+right[i]-1);
        }
        System.out.println(max);

    }
}
